The influence of social structure on the propagation of social information in artificial primate groups: a graph-based simulation approach.

نویسندگان

  • Bernhard Voelkl
  • Ronald Noë
چکیده

Observations of primate groups have shown that social learning can lead to the development of temporal stable traditions or even proto-culture. The social structure of primate groups is highly diverse and it has been proposed that differences in the group structure shall influence the patterns of social information transmission. While empirical studies have mainly focused on the psychological mechanisms of social learning in individuals, the phenomenon of information propagation within the group has received relatively little attention. This might be due to the fact that formal theories that allow actual testing have not been formulated, or were kept too simple, ignoring the social dynamics of multi-agent societies. We want to propose a network approach to social information transmission that (1) preserves the complexity of the social structure of primate groups and (2) allows direct application to empirical data. Results from simulation experiments with artificial group structures confirm that association patterns of group-members influence the expected speed of information transmission during the propagation process. Introducing a forgetting rate shows that under certain conditions the proportion of informed individuals will reach a stable rate in some systems while it will drop to zero in others. This suggests that the likelihood to observe temporal stable traditions shall differ between social systems with different structure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...

متن کامل

Overlapping Community Detection in Social Networks Based on Stochastic Simulation

Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...

متن کامل

An Optimized Firefly Algorithm based on Cellular Learning Automata for Community Detection in Social Networks

The structure of the community is one of the important features of social networks. A community is a sub graph which nodes have a lot of connections to nodes of inside the community and have very few connections to nodes of outside the community. The objective of community detection is to separate groups or communities that are linked more closely. In fact, community detection is the clustering...

متن کامل

Sampling from social networks’s graph based on topological properties and bee colony algorithm

In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...

متن کامل

A computational model and convergence theorem for rumor dissemination in social networks

The spread of rumors, which are known as unverified statements of uncertain origin, may threaten the society and it's controlling, is important for national security councils of countries. If it would be possible to identify factors affecting spreading a rumor (such as agents’ desires, trust network, etc.) then, this could be used to slow down or stop its spreading. Therefore, a computational m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of theoretical biology

دوره 252 1  شماره 

صفحات  -

تاریخ انتشار 2008